Restricted 2 { factors in Bipartite
نویسندگان
چکیده
The k{restricted 2{factor problem is that of nding a spanning subgraph consisting of disjoint cycles with no cycle of length less than or equal to k. It is a generalization of the well known Hamilton cycle problem and is equivalent to this problem when n 2 k n ? 1. This paper considers necessary and suucient conditions, algorithms, and polyhedral conditions for 2{factors in bipartite graphs and restricted 2{factors in bipartite graphs. We introduce a generalization of the necessary and suucient condition for 4{restricted 2{factors in bipartite graphs to 2k{restricted 2{factors in bipartite graphs of a particular form.
منابع مشابه
RIMS-1826 Approximation Algorithms for the Minimum 2-edge Connected Spanning Subgraph Problem and the Graph-TSP in Regular Bipartite Graphs via Restricted 2-factors By
In this paper, we address the minimum 2-edge connected spanning subgraph problem and the graph-TSP in regular bipartite graphs. For these problems, we present new approximation algorithms, each of which finds a restricted 2-factor close to a Hamilton cycle in the first step. We first prove that every regular bipartite graph of degree at least three has a square-free 2-factor. This immediately l...
متن کاملParallel Processing Letters Bipartite Expander Matching Is in Nc
A work-eecient deterministic NC algorithm is presented for nding a maximum matching in a bipartite expander graph with any expansion factor > 1. This improves upon a recently presented deterministic NC maximum matching algorithm which is restricted to those bipartite expanders with large expansion factors (; > 0), and is not work-eecient 1].
متن کاملAlternating paths revisited II: restricted b-matchings in bipartite graphs
We give a constructive proof for a min-max relation on restricted b-matchings in bipartite graphs, extending results of Hartvigsen [5, 6], Király [7], and Frank [3]. Restricted b-matching is a special case of covering pairs of sets, for which Benczúr and Végh [1, 2] constructed a polynomial time algorithm – this implies a polynomial time algorithm for restricted b-matchings, as well. In this pa...
متن کاملRestricted b-Factors in Bipartite Graphs and t-Designsy
We present a new equivalence result between restricted b-factors in bipartite graphs and combinatorial t-designs. This result is useful in the construction of t-designs by polyhedral methods. We propose a novel linear integer programming formulation, which we call GDP, for the problem of finding t-designs that has a noteworthy advantage compared to the traditional set-covering formulation. We a...
متن کاملBipartite Rigidity
We develop a bipartite rigidity theory for bipartite graphs parallel to the classical rigidity theory for general graphs, and define for two positive integers k, l the notions of (k, l)-rigid and (k, l)-stress free bipartite graphs. This theory coincides with the study of Babson–Novik’s balanced shifting restricted to graphs. We establish bipartite analogs of the cone, contraction, deletion, an...
متن کامل